-
Notifications
You must be signed in to change notification settings - Fork 16
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[documentation] Add a tutorial for LBFGS #404
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM. Maybe you could add a comment about LBFGSB for completeness?
Hence, the problem is good candidate for a quasi-Newton algorithm. | ||
|
||
We start by solving the problem with the default options in MadNLP, | ||
using the dense linear solver Lapack: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
using the dense linear solver Lapack: | |
using a dense linear solver from LAPACK: |
``` | ||
with ``\xi > 0`` a scaling factor, ``U_k`` and ``V_k`` two ``n \times 2p`` matrices. | ||
The number ``p`` denotes the number of vectors used when computing the limited memory updates | ||
(the parameter ``max_history`` in MadNLP): the larger, the more accurate is the low-rank approximation. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
(the parameter ``max_history`` in MadNLP): the larger, the more accurate is the low-rank approximation. | |
(the parameter `max_history` in MadNLP): the larger, the more accurate is the low-rank approximation. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
|
||
!!! info | ||
As MadNLP is designed to solve constrained optimization problems, | ||
it does not approximate the inverse of the Hessian matrix, as it is done |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
it does not approximate the inverse of the Hessian matrix, as it is done | |
it does not approximate the inverse of the Hessian matrix, as done |
cc @amontoison @blegat
Solve #400